Caches as Filters: A New Approach to Cache Analysis

نویسندگان

  • Dee A. B. Weikle
  • Sally A. McKee
  • William A. Wulf
چکیده

As the processor-memory performance gap continues to grow, so does the need for effective tools and metrics to guide the design of efficient memory hierarchies to bridge that gap. Aggregate statistics of cache performance can be useful for comparison, but they give us little insight into how to improve the design of a particular component. We propose a different approach to cache analysis — viewing caches as filters — and present two new metrics for analyzing cache behavior: instantaneous hit rate and instantaneous locality. We demonstrate how these measures can give us insight into the reference pattern of an executing program, and show an application of these measures in analyzing the effectiveness of the second level cache of a particular memory hierarchy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Cache Filter Model Caches As Filters : A Framework for the Analysis of Caching Systems Dee

Cape Cod, Massuchusetts. Abstract This paper introduces a new analytical framework for analyzing and designing caches. It consists of four major parts: TSpec notation, into which reference traces can be transformed; equivalence classes, which abstract away chance effects of address bindings and specific inputs; the functional filter model, which operates on TSpec traces and provides a formal de...

متن کامل

Caches as Filters: A Unifying Model for Memory Hierarchy Analysis

This paper outlines the new caches-as-filters framework for the analysis of caching systems, describing the functional filter model in detail. This model is more general than those introduced previously, allowing designers and compiler writers to understand why a cache exhibits a particular behavior, and in some cases indicating what compiler or hardware techniques must be employed to improve a...

متن کامل

Generalizing timing predictions to set-associative caches

Recently, research on the static prediction of worst-case execution time (WCET) of programs has been extended from simple CISC to pipelined RISC processors, and from uncached architectures to direct-mapped instruction caches. This work goes one step further by introducing a framework to handle WCET prediction for set-associative caches. Generalizing the work of static cache simulation of direct...

متن کامل

Write-Back Caches in WCET Analysis

Write-back caches are a popular choice in embedded microprocessors as they promise higher performance than write-through caches. So far, however, their use in hard real-time systems has been prohibited by the lack of adequate worst-case execution time (WCET) analysis support. In this paper, we introduce a new approach to statically analyze the behavior of write-back caches. Prior work took an “...

متن کامل

Timing Predictions for Multi-Level Caches

This paper describes a framework to extend timing predictions of real-time applications from architectures with primary caches to architectures with multi-level caches. First, general problems of extending timing analysis frameworks to multi-level memory hierarchies are discussed, including a method for dealing with uni-ed caches. Second, an existing data-ow framework for cache analysis, the fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998